Revisiting the Lexicographic Ordering Constraint
نویسندگان
چکیده
We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of n variables. The algorithm maintains arcconsistency, runs in O(n) time on posting plus amortized O(1) time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm was derived from a finite automaton operating on a string which captures the relationship between each variable pair of the two vectors.
منابع مشابه
Global constraints by composition: lexicographic ordering with sums
We introduce a new global constraint which combines together a lexicographic ordering constraint with some sum constraints. Applications for this constraint include balanced incomplete block designs and the ternary Steiner problem. We develop an efficient linear time algorithm for propagating this constraint. This combination of constraints increases the filtering, leading to significant decrea...
متن کاملCombining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
We introduce a new global constraint which combines together the lexicographic ordering constraint with some sum constraints. Lexicographic ordering constraints are frequently used to break symmetry, whilst sum constraints occur in many problems involving capacity or partitioning. Our results show that this global constraint is useful when there is a very large space to explore, such as when th...
متن کاملSix Ways of Integrating Symmetries within Non-overlapping Constraints
This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ...
متن کاملSymmetry in Matrix Models
Many constraint satisfaction problems (such as scheduling, assignment, and configuration) can be modelled as constraint programs based on matrices of decision variables. In such matrix models, symmetry is an important feature. We study and generalise symmetry-breaking techniques, such as lexicographic ordering, and propose a labelling technique achieving the same effect.
متن کاملPropagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constraint programming to a problem, it is modelled by a set of constraints on a set of decision variables. A common modelling pattern is the use of matrices of decision variables. The rows and/or columns of these matrices are ...
متن کامل